Random Graphs and the Strong Convergence of Bootstrap Means
نویسندگان
چکیده
منابع مشابه
Random Graphs And The Strong Convergence Of Bootstrap Means
We consider graphs Gn generated by multisets In with n random integers as elements, such that vertices of Gn are connected by edges if the elements of In that the vertices represent are the same, and prove asymptotic results on the sparsity of edges connecting the different subgraphs Gn of the random graph generated by ∪∞n=1In. These results are of independent interest and, for two models of th...
متن کاملthe investigation of research articles in applied linguistics: convergence and divergence in iranian elt context
چکیده ندارد.
Bootstrap Percolation on Geometric Inhomogeneous Random Graphs
Geometric inhomogeneous random graphs (GIRGs) are a model for scale-free networks with underlying geometry. We study bootstrap percolation on these graphs, which is a process modelling the spread of an infection of vertices starting within a (small) local region. We show that the process exhibits a phase transition in terms of the initial infection rate in this region. We determine the speed of...
متن کاملMeasuring the Algorithmic Convergence of Random Forests via Bootstrap Extrapolation
When making predictions with a voting rule, a basic question arises: “What is the smallest number of votes needed to make a good prediction?” In the context of ensemble classifiers, such as Random Forests or Bagging, this question represents a tradeoff between computational cost and statistical performance. Namely, by paying a larger computational price for more classifiers, the prediction erro...
متن کاملBootstrap Percolation in Directed Inhomogeneous Random Graphs
Bootstrap percolation is a process that is used to model the spread of an infection on a given graph. In the model considered here each vertex is equipped with an individual threshold. As soon as the number of infected neighbors exceeds that threshold, the vertex gets infected as well and remains so forever. We perform a thorough analysis of bootstrap percolation on a novel model of directed an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorics, Probability and Computing
سال: 2000
ISSN: 0963-5483,1469-2163
DOI: 10.1017/s0963548300004296